Improved bounds for the sunflower lemma
نویسندگان
چکیده
A sunflower with $r$ petals is a collection of sets so that the intersection each pair equal to all them. Erd?s and Rado proved lemma: for any fixed $r$, family size $w$, at least about $w^w$ sets, must contain petals. The famous conjecture states bound on number can be improved $c^w$ some constant $c$. In this paper, we improve $\mathrm{log}\ w)^w$. fact, prove result robust notion sunflowers, which obtain sharp up lower order terms.
منابع مشابه
Improved bounds and parallel algorithms for the Lovasz Local Lemma
The Lovász Local Lemma (LLL) is a cornerstone principle in the probabilistic method of combinatorics, and a seminal algorithm of Moser & Tardos (2010) provided an efficient randomized algorithm to implement it. This algorithm could be parallelized to give an algorithm that uses polynomially many processors and O(log n) time, stemming from O(log n) adaptive computations of a maximal independent ...
متن کاملDerandomizing the Isolation Lemma and Lower Bounds for Circuit Size
The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministic identity tests has received a lot of...
متن کاملAn Improved Approximate S-Lemma
The purpose of this note is to improve an error bound in the Approximate SLemma used in establishing levels of conservatism results for approximate robust counterparts.
متن کاملMultiply-Recursive Upper Bounds with Higman's Lemma
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for well-structured systems.
متن کاملAn improved bound for the stepping-up lemma
The partition relation N → (n) l means that whenever the k-tuples of an N -element set are lcolored, there is a monochromatic set of size n, where a set is called monochromatic if all its k-tuples have the same color. The logical negation of N → (n) l is written as N 6→ (n) l . An ingenious construction of Erdős and Hajnal known as the stepping-up lemma gives a negative partition relation for h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2021
ISSN: ['1939-8980', '0003-486X']
DOI: https://doi.org/10.4007/annals.2021.194.3.5